Optimal domains for disjunctive abstract interpretation
نویسندگان
چکیده
منابع مشابه
Abstract Interpretation over Non-lattice Abstract Domains
Interpretation over Non-Lattice Abstract Domains Graeme Gange, Jorge A. Navas, Peter Schachte, Harald Søndergaard, and Peter J. Stuckey Department of Computing and Information Systems, The University of Melbourne, Victoria 3010, Australia {gkgange,jorge.navas,schachte,harald,pstuckey}@unimelb.edu.au Abstract. The classical theoretical framework for static analysis of programs is abstract interp...
متن کاملSMT-Based and Disjunctive Relational Abstract Domains for Static Analysis
Abstract Interpretation is a theory of sound approximation of program semantics. In recent decades, it has been widely and successfully applied to the static analysis of computer programs. In this thesis, we will work on abstract domains, one of the key concepts in abstract interpretation, which aim at automatically collecting information about the set of all possible values of the program vari...
متن کاملDonut Domains: Efficient Non-convex Domains for Abstract Interpretation
Program analysis using abstract interpretation has been successfully applied in practice to find runtime bugs or prove software correct. Most abstract domains that are used widely rely on convexity for their scalability. However, the ability to express non-convex properties is sometimes required in order to achieve a precise analysis of some numerical properties. This work combines already know...
متن کاملBlock-Wise Abstract Interpretation by Combining Abstract Domains with SMT
domains with SMT Jiahong Jiang, Liqian Chen, Xueguang Wu, and Ji Wang School of Computer Science, National University of Defense Technology, China State Key Laboratory of High Performance Computing, China {jhjiang,lqchen,xueguangwu,wj}@nudt.edu.cn Abstract. Statement-wise abstract interpretation that calculates the abstract semantics of a program statement by statement, is scalable but may caus...
متن کاملQuasi-metric Spaces as Domains for Abstract Interpretation
Metrics and more generally quasi-metrics are well krwwn in literature on domain theory and the semantics of programming languages. In this paper, we consider the role of quasi-metrics in defining abstract interpretations. ln fact these allow bot h to represent a notion of approximation together witll the error introduced, and to apply, under suitable conditions, Danach's contraction principle.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science of Computer Programming
سال: 1998
ISSN: 0167-6423
DOI: 10.1016/s0167-6423(97)00034-8